Notes on Electronic Lexicography

نویسنده

  • Yavor Angelov Parvanov
چکیده

Эти заметки являются продолжением темы, затронутой в статье В. Селегея Электронные словари и компьютерная лексикография. Речь пойдет о том, каким может быть электронный словарь, имеющий в качестве объекта описания близкородственные языки. Очевидно, такая постановка вопроса допускает несколько вариантов ответов, а единственным подтверждением правильности каждого из них мог бы стать словарь или словари действующие продукты, созданные в электронном виде, существующие на электронном носителе, предназначенные для электронного чтения и имеющие перспективы электронного развития. Мы постараемся обойтись без противопоставления “традиционный – новый”, “классический – современный” и т.д., потому что об этом написано немало и не только по поводу бумажных и электронных словарей.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The graph distance game and some graph operations

In the graph distance game, two players alternate in constructing a maximal path. The objective function is the distance between the two endpoints of the path, which one player tries to maximize and the other tries to minimize. In this paper we examine the distance game for various graph operations: the join, the corona and the lexicographic product of graphs. We provide general bounds and exac...

متن کامل

The MuLeXFoR Database: Representing Word-Formation Processes in a Multilingual Lexicographic Environment

This paper introduces a new lexicographic resource, the MuLeXFoR database, which aims to present word-formation processes in a multilingual environment. Morphological items represent a real challenge for lexicography, especially for the development of multilingual tools. The database introduced in this paper tries to take advantage of recent advances in electronic implementation and morphologic...

متن کامل

On the representatives k-fold coloring polytope

A k-fold x-coloring of a graph G is an assignment of (at least) k distinct colors from the set {1, 2, . . . , x} to each vertex such that any two adjacent vertices are assigned disjoint sets of colors. The k-th chromatic number of G, denoted by χk(G), is the smallest x such that G admits a k-fold x-coloring. We present an ILP formulation to determine χk(G) and study the facial structure of the ...

متن کامل

- 17 - Interactive Phonetics , virtually !

This paper presents a set of phonetics teaching resources as modules in a more generic framework for web-based tutoring in the areas of phonetics, multimedia communication and spoken language research. Currently the toolkit consists of standalone interactive modules and lecture notes on a number of areas of phonetics, phonology and the lexicography of spoken language. The interactive presentati...

متن کامل

A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution

In this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1107.1753  شماره 

صفحات  -

تاریخ انتشار 2011